91 research outputs found
Demystifying Deep Learning: A Geometric Approach to Iterative Projections
Parametric approaches to Learning, such as deep learning (DL), are highly
popular in nonlinear regression, in spite of their extremely difficult training
with their increasing complexity (e.g. number of layers in DL). In this paper,
we present an alternative semi-parametric framework which foregoes the
ordinarily required feedback, by introducing the novel idea of geometric
regularization. We show that certain deep learning techniques such as residual
network (ResNet) architecture are closely related to our approach. Hence, our
technique can be used to analyze these types of deep learning. Moreover, we
present preliminary results which confirm that our approach can be easily
trained to obtain complex structures.Comment: To be appeared in the ICASSP 2018 proceeding
Deep Dictionary Learning: A PARametric NETwork Approach
Deep dictionary learning seeks multiple dictionaries at different image
scales to capture complementary coherent characteristics. We propose a method
for learning a hierarchy of synthesis dictionaries with an image classification
goal. The dictionaries and classification parameters are trained by a
classification objective, and the sparse features are extracted by reducing a
reconstruction loss in each layer. The reconstruction objectives in some sense
regularize the classification problem and inject source signal information in
the extracted features. The performance of the proposed hierarchical method
increases by adding more layers, which consequently makes this model easier to
tune and adapt. The proposed algorithm furthermore, shows remarkably lower
fooling rate in presence of adversarial perturbation. The validation of the
proposed approach is based on its classification performance using four
benchmark datasets and is compared to a CNN of similar size
Analysis Dictionary Learning: An Efficient and Discriminative Solution
Discriminative Dictionary Learning (DL) methods have been widely advocated
for image classification problems. To further sharpen their discriminative
capabilities, most state-of-the-art DL methods have additional constraints
included in the learning stages. These various constraints, however, lead to
additional computational complexity. We hence propose an efficient
Discriminative Convolutional Analysis Dictionary Learning (DCADL) method, as a
lower cost Discriminative DL framework, to both characterize the image
structures and refine the interclass structure representations. The proposed
DCADL jointly learns a convolutional analysis dictionary and a universal
classifier, while greatly reducing the time complexity in both training and
testing phases, and achieving a competitive accuracy, thus demonstrating great
performance in many experiments with standard databases.Comment: ICASSP 201
Community Detection and Improved Detectability in Multiplex Networks
We investigate the widely encountered problem of detecting communities in
multiplex networks, such as social networks, with an unknown arbitrary
heterogeneous structure. To improve detectability, we propose a generative
model that leverages the multiplicity of a single community in multiple layers,
with no prior assumption on the relation of communities among different layers.
Our model relies on a novel idea of incorporating a large set of generic
localized community label constraints across the layers, in conjunction with
the celebrated Stochastic Block Model (SBM) in each layer. Accordingly, we
build a probabilistic graphical model over the entire multiplex network by
treating the constraints as Bayesian priors. We mathematically prove that these
constraints/priors promote existence of identical communities across layers
without introducing further correlation between individual communities. The
constraints are further tailored to render a sparse graphical model and the
numerically efficient Belief Propagation algorithm is subsequently employed. We
further demonstrate by numerical experiments that in the presence of consistent
communities between different layers, consistent communities are matched, and
the detectability is improved over a single layer. We compare our model with a
"correlated model" which exploits the prior knowledge of community correlation
between layers. Similar detectability improvement is obtained under such a
correlation, even though our model relies on much milder assumptions than the
correlated model. Our model even shows a better detection performance over a
certain correlation and signal to noise ratio (SNR) range. In the absence of
community correlation, the correlation model naturally fails, while ours
maintains its performance
Information diffusion in interconnected heterogeneous networks
In this paper, we are interested in modeling the diffusion of information in
a multilayer network using thermodynamic diffusion approach. State of each
agent is viewed as a topic mixture represented by a distribution over multiple
topics. We have observed and learned diffusion-related thermodynamical patterns
in the training data set, and we have used the estimated diffusion structure to
predict the future states of the agents. A priori knowledge of a fraction of
the state of all agents changes the problem to be a Kalman predictor problem
that refines the predicted system state using the error in estimation of the
agents. A real world Twitter data set is then used to evaluate and validate our
information diffusion model.Comment: 5-9 March 2017. arXiv admin note: substantial text overlap with
arXiv:1602.0485
- …